195 research outputs found
Capacity and Stable Scheduling in Heterogeneous Wireless Networks
Heterogeneous wireless networks (HetNets) provide a means to increase network
capacity by introducing small cells and adopting a layered architecture.
HetNets allocate resources flexibly through time sharing and cell range
expansion/contraction allowing a wide range of possible schedulers. In this
paper we define the capacity of a HetNet down link in terms of the maximum
number of downloads per second which can be achieved for a given offered
traffic density. Given this definition we show that the capacity is determined
via the solution to a continuous linear program (LP). If the solution is
smaller than 1 then there is a scheduler such that the number of mobiles in the
network has ergodic properties with finite mean waiting time. If the solution
is greater than 1 then no such scheduler exists. The above results continue to
hold if a more general class of schedulers is considered.Comment: 30 pages, 6 figure
Millimeter Wave Beam Alignment: Large Deviations Analysis and Design Insights
In millimeter wave cellular communication, fast and reliable beam alignment
via beam training is crucial to harvest sufficient beamforming gain for the
subsequent data transmission. In this paper, we establish fundamental limits in
beam-alignment performance under both the exhaustive search and the
hierarchical search that adopts multi-resolution beamforming codebooks,
accounting for time-domain training overhead. Specifically, we derive lower and
upper bounds on the probability of misalignment for an arbitrary level in the
hierarchical search, based on a single-path channel model. Using the method of
large deviations, we characterize the decay rate functions of both bounds and
show that the bounds coincide as the training sequence length goes large. We go
on to characterize the asymptotic misalignment probability of both the
hierarchical and exhaustive search, and show that the latter asymptotically
outperforms the former, subject to the same training overhead and codebook
resolution. We show via numerical results that this relative performance
behavior holds in the non-asymptotic regime. Moreover, the exhaustive search is
shown to achieve significantly higher worst-case spectrum efficiency than the
hierarchical search, when the pre-beamforming signal-to-noise ratio (SNR) is
relatively low. This study hence implies that the exhaustive search is more
effective for users situated further from base stations, as they tend to have
low SNR.Comment: Author final manuscript, to appear in IEEE Journal on Selected Areas
in Communications (JSAC), Special Issue on Millimeter Wave Communications for
Future Mobile Networks, 2017 (corresponding author: Min Li
Design and Analysis of Transmit Beamforming for Millimetre Wave Base Station Discovery
In this paper, we develop an analytical framework for the initial access
(a.k.a. Base Station (BS) discovery) in a millimeter-wave (mm-wave)
communication system and propose an effective strategy for transmitting the
Reference Signals (RSs) used for BS discovery. Specifically, by formulating the
problem of BS discovery at User Equipments (UEs) as hypothesis tests, we derive
a detector based on the Generalised Likelihood Ratio Test (GLRT) and
characterise the statistical behaviour of the detector. The theoretical results
obtained allow analysis of the impact of key system parameters on the
performance of BS discovery, and show that RS transmission with narrow beams
may not be helpful in improving the overall BS discovery performance due to the
cost of spatial scanning. Using the method of large deviations, we identify the
desirable beam pattern that minimises the average miss-discovery probability of
UEs within a targeted detectable region. We then propose to transmit the RS
with sequential scanning, using a pre-designed codebook with narrow and/or wide
beams to approximate the desirable patterns. The proposed design allows
flexible choices of the codebook sizes and the associated beam widths to better
approximate the desirable patterns. Numerical results demonstrate the
effectiveness of the proposed method.Comment: 30 pages, 13 figures, submitte
Locomotion analysis and optimization of actinomorphic robots with soft arms actuated by shape memory alloy wires
This article presents the locomotion analysis and optimization of actinomorphic soft robots, which are composed of soft arms actuated by shape memory alloy wires. The soft arm that is a composite modular structure is actuated by a self-sensing feedback control strategy. A theoretical model was established to describe the deformation of the soft arm, combining the Euler-Bernoulli beam model of the soft arm with the constitutive model and the heat transfer model of the shape memory alloy wire. The kinematics of the actinomorphic soft robot was analyzed using the modified Denavit-Hartenberg method, and the motion equation of the actinomorphic soft robot was presented based on the quasi-static hypothesis. Results show that the actinomorphic soft robot moves with a zig-zag pattern. The locomotion of four actinomorphic soft robots with three to six arms was analyzed, and the gait parameters of each locomotion type were optimized. The optimization results indicate that the three-arm actinomorphic robot with certain gait parameters has the best performance and achieves a maximum stride length of 75 mm. A series of experiments were conducted to investigate the movement performance of the three-arm actinomorphic robot in various environments
- …